The Elongation Domain of ELL Is Dispensable but Its ELL-Associated Factor 1 Interaction Domain Is Essential for MLL-ELL-Induced Leukemogenesis
نویسندگان
چکیده
منابع مشابه
EAF1, a novel ELL-associated factor that is delocalized by expression of the MLL-ELL fusion protein.
The (11;19)(q23;p13.1) translocation in acute leukemia leads to the generation of a chimeric protein that fuses MLL to the transcriptional elongation factor ELL. A novel protein was isolated from a yeast 2-hybrid screen with ELL that was named EAF1 for ELL-associated factor 1. Using specific antibodies, the endogenous EAF1 and ELL proteins were coimmunoprecipitated from multiple cell lines. In ...
متن کاملA $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملELL-associated factor 2 (EAF2), a functional homolog of EAF1 with alternative ELL binding properties.
The (11;19)(q23;p13.1) translocation in acute leukemia results in the formation of an MLL-ELL fusion protein. ELL is an RNA polymerase II elongation factor that interacts with the recently identified EAF1 protein. To characterize the normal functions of ELL and its aberrant activities when fused to MLL, we isolated a second protein that interacts with ELL named EAF2 for ELL Associated Factor 2....
متن کاملRethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...
متن کاملLearning with $\ell^{0}$-Graph: $\ell^{0}$-Induced Sparse Subspace Clustering
ℓ 1-graph [19, 4], a sparse graph built by reconstructing each datum with all the other data using sparse representation , has been demonstrated to be effective in clustering high dimensional data and recovering independent subspaces from which the data are drawn. It is well known that ℓ 1-norm used in ℓ 1-graph is a convex relaxation of ℓ 0-norm for enforcing the sparsity. In order to handle g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular and Cellular Biology
سال: 2001
ISSN: 0270-7306,1098-5549
DOI: 10.1128/mcb.21.16.5678-5687.2001